Hamilton's theory of turns revisited

We present a new approach to Hamilton's theory of turns for the groups SO(3) and SU(2) which renders their properties, in particular their composition law, nearly trivial and immediately evident upon inspection. We show that the entire construction can be based on binary rotations rather than mirror reflections.Comment: 7 pages, 4 figure

Prophylactic Neutrality, Oppression, and the Reverse Pascal's Wager

In Beyond Neutrality, George Sher criticises the idea that state neutrality between competing conceptions of the good helps protect society from oppression. While he is correct that some governments are non-neutral without being oppressive, I argue that those governments may be neutral at the core of their foundations. The possibility of non-neutrality leading to oppression is further explored; some conceptions of the good would favour oppression while others would not. While it is possible that a non-neutral state may avoid oppression, it is argued that the risks are so great that it is better to bet on government being neutral, thereby minimizing the possibility of oppression

Hamilton's Turns for the Lorentz Group

Hamilton in the course of his studies on quaternions came up with an elegant geometric picture for the group SU(2). In this picture the group elements are represented by ``turns'', which are equivalence classes of directed great circle arcs on the unit sphere $S^2$, in such a manner that the rule for composition of group elements takes the form of the familiar parallelogram law for the Euclidean translation group. It is only recently that this construction has been generalized to the simplest noncompact group $SU(1,1) = Sp(2, R) = SL(2,R)$, the double cover of SO(2,1). The present work develops a theory of turns for $SL(2,C)$, the double and universal cover of SO(3,1) and $SO(3,C)$, rendering a geometric representation in the spirit of Hamilton available for all low dimensional semisimple Lie groups of interest in physics. The geometric construction is illustrated through application to polar decomposition, and to the composition of Lorentz boosts and the resulting Wigner or Thomas rotation.Comment: 13 pages, Late

Moments of the Wigner Distribution and a Generalized Uncertainty Principle

The nonnegativity of the density operator of a state is faithfully coded in its Wigner distribution, and this places constraints on the moments of the Wigner distribution. These constraints are presented in a canonically invariant form which is both concise and explicit. Since the conventional uncertainty principle is such a constraint on the first and second moments, our result constitutes a generalization of the same to all orders. Possible application in quantum state reconstruction using optical homodyne tomography is noted.Comment: REVTex, no figures, 9 page

Choosing Products in Social Networks

We study the consequences of adopting products by agents who form a social network. To this end we use the threshold model introduced in Apt and Markakis, arXiv:1105.2434, in which the nodes influenced by their neighbours can adopt one out of several alternatives, and associate with such each social network a strategic game between the agents. The possibility of not choosing any product results in two special types of (pure) Nash equilibria. We show that such games may have no Nash equilibrium and that determining the existence of a Nash equilibrium, also of a special type, is NP-complete. The situation changes when the underlying graph of the social network is a DAG, a simple cycle, or has no source nodes. For these three classes we determine the complexity of establishing whether a (special type of) Nash equilibrium exists. We also clarify for these categories of games the status and the complexity of the finite improvement property (FIP). Further, we introduce a new property of the uniform FIP which is satisfied when the underlying graph is a simple cycle, but determining it is co-NP-hard in the general case and also when the underlying graph has no source nodes. The latter complexity results also hold for verifying the property of being a weakly acyclic game.Comment: 15 pages. Appeared in Proc. of the 8th International Workshop on Internet and Network Economics (WINE 2012), Lecture Notes in Computer Science 7695, Springer, pp. 100-11